CONSTRUCTING WADGE CLASSES
نویسندگان
چکیده
Abstract We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those level $\omega _1$ (that is, ones that are closed under Borel preimages) and iteratively applying operations expansion separated differences. The proof is essentially due to Louveau, it yields at same time a new theorem Van Wesep (namely, expressed as result Hausdorff operation applied open sets). exposition self-contained, except for facts from classical descriptive set theory.
منابع مشابه
Potential Wadge classes
Let Γ be a Borel class, or a Wadge class of Borel sets, and 2≤d≤ω a cardinal. We study the Borel subsets of R that can be made Γ by refining the Polish topology on the real line. These sets are called potentially Γ. We give a test to recognize potentially Γ sets. 2010 Mathematics Subject Classification. Primary: 03E15, Secondary: 54H05, 28A05, 26A21
متن کاملDeterminacy of Wadge classes and subsystems of second order arithmetic
In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0, which consists of the axioms of discrete ordered semi-ring with exponentiation, ∆1 comprehension and Π 0 0 induction, and which is k...
متن کاملConstructing equidissections for certain classes of trapezoids
We investigate equidissections of a trapezoid T (a), where the ratio of the lengths of two parallel sides is a. (An equidissection is a dissection into triangles of equal areas.) An integer n is in the spectrum S T (a) if T (a) admits an equidissection into n triangles. Suppose a is algebraic of degree 2 or 3, with each conjugate over Q having positive real part. We show that if n is large enou...
متن کاملCorrigendum of “Determinacy of Wadge classes and subsystems of second order arithmetic”
for a pair (θ0(x), θ1(x)) of Π0 formulae such that, for all f ∈ {0, 1}N, ∀n(∃m > n)θ0(f [m]) if and only if ¬∀n∃m > nθ1(f [m]). We may assume that {s ∈ {0, 1}<N : θ0(s) ∧ θ1(s)} = ∅ and θ0(⟨⟩) by replacing θ0(x) with θ′ 0(x) ≡ (θ0(x) ∧ ¬θ1(x)) ∨ (x = ⟨⟩) and θ1(x) with θ′ 1(x) ≡ θ1(x) ∧ ¬θ0(x) ∧ (x ̸= ⟨⟩) if necessary. The above tree Tθ0,θ1 is well-founded, for if F were an infinite path of Tθ0,...
متن کاملMore on Wadge determinacy
We show that the semi-linear ordering principle for continuous functions implies the determinacy of all Wadge and Lipschitz games. c © 2006 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2022
ISSN: ['1943-5894', '1079-8986']
DOI: https://doi.org/10.1017/bsl.2022.7